Flexible group-based interprocess communication facilities for heterogeneous parallel architectures

نویسندگان

  • Pedro D. Medeiros
  • José C. Cunha
چکیده

PDVM (Parallel and Distributed Virtual Machine) is a runtime environment targeted at the execution of parallel programs in a heterogeneous architecture composed of distributed-memory multiprocessors and uniprocessors connected by a local area network. The most distinctive feature of PDVM is its support for group-based communication primitives. Several dimensions arise when defining a group-based communication facility. The type of process groups supported can range from groups with static composition and no guarantees of ordered delivery of successive broadcasts to dynamic process groups which guarantee an uniform and consistent view for all the members of the group, concerning communication and membership changes. Of course, increased functionality is paid in more overhead. PDVM allows the programmer to specify the properties of the group in its creation, according to the needs of the application. On the other side PDVM uses techniques borrowed from Horus to achieve efficient implementations of richer semantics for groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of a novel congestion-aware communication mechanism for wireless NoC architecture in multicore systems

Hybrid Wireless Network-on-Chip (WNoC) architecture is emerged as a scalable communication structure to mitigate the deficits of traditional NOC architecture for the future Multi-core systems. The hybrid WNoC architecture provides energy efficient, high data rate and flexible communications for NoC architectures. In these architectures, each wireless router is shared by a set of processing core...

متن کامل

The Mask Tuning Scheme for Texture Feature Extraction and Its Parallel Implementation

This paper describes the parallel extension of the mask tuning scheme for texture feature extraction. Unlike other parallel systems in which specific parallel computer architectures are required, our parallel solution to increase processing speed is examined by introducing the concept of remote procedure call(RPC) in distributed systems for Iocal or remote interprocess communication. Based on o...

متن کامل

A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

This paper presents a compile-time scheduling heuristic called dynamic level scheduling, which accounts for interprocessor communication overhead when mapping precedence-constrained, communicating tasks onto heterogeneous processor architectures with limited or possibly irregular interconnection structures. This technique uses dynamicallychanging priorities to match tasks with processors at eac...

متن کامل

Pipelined Parallelism in Multi-Join Queries on Heterogeneous Shared Nothing Architectures

Pipelined parallelism was largely studied and successfully implemented, on shared nothing machines, in several join algorithms in the presence of ideal conditions of load balancing between processors and in the absence of data skew. The aim of pipelining is to allow flexible resource allocation while avoiding unnecessary disk input/output for intermediate join results in the treatment of multi-...

متن کامل

Scalable Parallel Sparse Factorization with Left-right Looking Strategy on Shared Memory Multiprocessors 1 Scalable Parallel Sparse Factorization with Left-right Looking Strategy on Shared Memory Multiprocessors

An eecient sparse LU factorization algorithm on popular shared memory mul-tiprocessors is presented. Interprocess communication is critically important on these architectures-the algorithm introduces O(n) synchronization events only. No global barrier is used and a completely asynchronous scheduling scheme is one central point of the implementation. The algorithm aims at optimizing the single n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011